In this paper , we brought out the concept of “ ergodic matrix ” , and gave out the recursion formula ( ii ) which can construct the ergodic matrix q with n n dimensions using a vector with n dimension . that is , we can delegate n2 bits ergodic matrix q using n bits integer vector , at the same time save the complexity of space and time 在此基礎上,本文對利用遍歷矩陣生成信息摘要以及利用它們實現一般數字簽名和具有仲裁方式的數字簽名的算法及應用進行了相關的一些研究,對算法的強度進行了分析,并用程序對算法進行了驗證。
If the matrix can be turned to be a symmetric one , the cg iteration can be used thereby . based on the above considerations , there have mainly done the following studies in the paper : ( 1 ) for the incomplete cholesky decomposition , there first derived an efficient implementation with the help of several integer vectors , and the computation of its modification is also in consideration 在如上研究背景下,本文主要作了以下工作: ( 1 )針對帶門檻不完全cholesky分解( ict ) ,首先采用增加少量幾個整型數組的方法對其作了高效實現,并在此基礎上提出了其修正型算法的計算方案。